0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.35	% Computer   : n005.cluster.edu
0.15/0.35	% Model      : x86_64 x86_64
0.15/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory     : 8042.1875MB
0.15/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.35	% CPULimit   : 1200
0.15/0.35	% WCLimit    : 120
0.15/0.35	% DateTime   : Tue Jul 13 14:06:03 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.36	% Number of cores: 8
0.15/0.36	% Python version: Python 3.6.8
0.15/0.36	# Version: 2.6rc1-ho
0.15/0.37	# No SInE strategy applied
0.15/0.37	# Trying AutoSched0 for 59 seconds
23.57/23.76	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
23.57/23.76	# and selection function SelectMaxLComplexAvoidPosPred.
23.57/23.76	#
23.57/23.76	# Preprocessing time       : 0.100 s
23.57/23.76	
23.57/23.76	# Proof found!
23.57/23.76	# SZS status Theorem
23.57/23.76	# SZS output start CNFRefutation
23.57/23.76	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)).
23.57/23.76	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)).
23.57/23.76	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
23.57/23.76	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
23.57/23.76	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_non)).
23.57/23.76	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X480:$i]:(in @ X480 @ X1=>(X2 @ X480=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_some)).
23.57/23.76	thf(def_n_is, axiom, (n_is)=(^[X556:$i, X557:$i]:(X556)=(X557)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
23.57/23.76	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
23.57/23.76	thf(def_n_some, axiom, (n_some)=(^[X558:$i > $o]:(![X559:$i]:(in @ X559 @ nat=>(X558 @ X559=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)).
23.57/23.76	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)).
23.57/23.76	thf(def_l_or, axiom, (l_or)=(^[X42:$o, X475:$o]:((X42=>~$true)=>X475)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_or)).
23.57/23.76	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X580:$i]:(in @ X580 @ nat=>((X1)=(n_pl @ X184 @ X580)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_d_29_ii)).
23.57/23.76	thf(def_moreis, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X587:$i]:(in @ X587 @ nat=>((X1)=(n_pl @ X187 @ X587)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_moreis)).
23.57/23.76	thf(def_iii, axiom, (iii)=(^[X1:$i, X185:$i]:(![X583:$i]:(in @ X583 @ nat=>((X185)=(n_pl @ X1 @ X583)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_iii)).
23.57/23.76	thf(satz25a, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X258:$i]:in @ X258 @ nat) @ (^[X259:$i]:(moreis @ X259 @ (ordsucc @ X1)<=d_29_ii @ X259 @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz25a)).
23.57/23.76	thf(def_lessis, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X588:$i]:(in @ X588 @ nat=>((X188)=(n_pl @ X1 @ X588)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_lessis)).
23.57/23.76	thf(satz25c, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X313:$i]:in @ X313 @ nat) @ (^[X314:$i]:(iii @ X314 @ X1=>lessis @ (ordsucc @ X314) @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz25c)).
23.57/23.76	thf(c_0_17, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
23.57/23.76	thf(c_0_18, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
23.57/23.76	thf(c_0_19, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_17])).
23.57/23.76	thf(c_0_20, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X480:$i]:(in @ X480 @ X1=>(X2 @ X480=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_18]), c_0_17]), c_0_19])).
23.57/23.76	thf(c_0_21, axiom, (n_is)=(^[X556:$i, X557:$i]:(X556)=(X557)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
23.57/23.76	thf(c_0_22, axiom, (n_some)=(^[X558:$i > $o]:(![X559:$i]:(in @ X559 @ nat=>(X558 @ X559=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_20])).
23.57/23.77	thf(c_0_23, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_21])).
23.57/23.77	thf(c_0_24, axiom, (l_or)=(^[X42:$o, X475:$o]:((X42=>~$true)=>X475)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_or, def_imp]), c_0_17])).
23.57/23.77	thf(c_0_25, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X580:$i]:(in @ X580 @ nat=>((X1)=(n_pl @ X184 @ X580)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_22]), c_0_23])).
23.57/23.77	thf(c_0_26, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X587:$i]:(in @ X587 @ nat=>((X1)=(n_pl @ X187 @ X587)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_moreis, c_0_24]), c_0_21]), c_0_25])).
23.57/23.77	thf(c_0_27, axiom, (iii)=(^[X1:$i, X185:$i]:(![X583:$i]:(in @ X583 @ nat=>((X185)=(n_pl @ X1 @ X583)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_iii, c_0_22]), c_0_23])).
23.57/23.77	thf(c_0_28, plain, ![X1720:$i]:(in @ X1720 @ nat=>![X1726:$i]:(in @ X1726 @ nat=>(~(![X1728:$i]:(in @ X1728 @ nat=>(X1726)!=(n_pl @ X1720 @ X1728)))=>(![X1727:$i]:(in @ X1727 @ nat=>(X1726)!=(n_pl @ (ordsucc @ X1720) @ X1727))=>(X1726)=(ordsucc @ X1720))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz25a, c_0_18]), c_0_25]), c_0_26])])).
23.57/23.77	thf(c_0_29, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X588:$i]:(in @ X588 @ nat=>((X188)=(n_pl @ X1 @ X588)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_lessis, c_0_24]), c_0_21]), c_0_27])).
23.57/23.77	thf(c_0_30, plain, ![X3132:$i, X3133:$i, X3134:$i]:((in @ (esk72_2 @ X3132 @ X3133) @ nat|(X3133)=(ordsucc @ X3132)|(~in @ X3134 @ nat|(X3133)!=(n_pl @ X3132 @ X3134))|~in @ X3133 @ nat|~in @ X3132 @ nat)&((X3133)=(n_pl @ (ordsucc @ X3132) @ (esk72_2 @ X3132 @ X3133))|(X3133)=(ordsucc @ X3132)|(~in @ X3134 @ nat|(X3133)!=(n_pl @ X3132 @ X3134))|~in @ X3133 @ nat|~in @ X3132 @ nat)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])).
23.57/23.77	thf(c_0_31, negated_conjecture, ~(![X2319:$i]:(in @ X2319 @ nat=>![X2325:$i]:(in @ X2325 @ nat=>(~(![X2326:$i]:(in @ X2326 @ nat=>(X2319)!=(n_pl @ X2325 @ X2326)))=>(![X2327:$i]:(in @ X2327 @ nat=>(X2319)!=(n_pl @ (ordsucc @ X2325) @ X2327))=>(ordsucc @ X2325)=(X2319)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz25c]), c_0_18]), c_0_27]), c_0_29])])).
23.57/23.77	thf(c_0_32, plain, ![X1:$i, X5:$i, X4:$i]:((X1)=(n_pl @ (ordsucc @ X4) @ (esk72_2 @ X4 @ X1))|(X1)=(ordsucc @ X4)|~in @ X5 @ nat|(X1)!=(n_pl @ X4 @ X5)|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_30])).
23.57/23.77	thf(c_0_33, negated_conjecture, ![X3253:$i]:(in @ esk93_0 @ nat&(in @ esk94_0 @ nat&((in @ esk95_0 @ nat&(esk93_0)=(n_pl @ esk94_0 @ esk95_0))&((~in @ X3253 @ nat|(esk93_0)!=(n_pl @ (ordsucc @ esk94_0) @ X3253))&(ordsucc @ esk94_0)!=(esk93_0))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])).
23.57/23.77	thf(c_0_34, plain, ![X5:$i, X4:$i, X1:$i]:(in @ (esk72_2 @ X1 @ X4) @ nat|(X4)=(ordsucc @ X1)|~in @ X5 @ nat|(X4)!=(n_pl @ X1 @ X5)|~in @ X4 @ nat|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_30])).
23.57/23.77	thf(c_0_35, plain, ![X4:$i, X1:$i]:((n_pl @ (ordsucc @ X1) @ (esk72_2 @ X1 @ (n_pl @ X1 @ X4)))=(n_pl @ X1 @ X4)|(n_pl @ X1 @ X4)=(ordsucc @ X1)|~in @ (n_pl @ X1 @ X4) @ nat|~in @ X4 @ nat|~in @ X1 @ nat), inference(er,[status(thm)],[c_0_32])).
23.57/23.77	thf(c_0_36, negated_conjecture, (esk93_0)=(n_pl @ esk94_0 @ esk95_0), inference(split_conjunct,[status(thm)],[c_0_33])).
23.57/23.77	thf(c_0_37, negated_conjecture, in @ esk93_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_33])).
23.57/23.77	thf(c_0_38, negated_conjecture, in @ esk95_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_33])).
23.57/23.77	thf(c_0_39, negated_conjecture, in @ esk94_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_33])).
23.57/23.77	thf(c_0_40, negated_conjecture, (ordsucc @ esk94_0)!=(esk93_0), inference(split_conjunct,[status(thm)],[c_0_33])).
23.57/23.77	thf(c_0_41, plain, ![X4:$i, X1:$i]:((n_pl @ X1 @ X4)=(ordsucc @ X1)|in @ (esk72_2 @ X1 @ (n_pl @ X1 @ X4)) @ nat|~in @ (n_pl @ X1 @ X4) @ nat|~in @ X4 @ nat|~in @ X1 @ nat), inference(er,[status(thm)],[c_0_34])).
23.57/23.77	thf(c_0_42, negated_conjecture, ![X1:$i]:(~in @ X1 @ nat|(esk93_0)!=(n_pl @ (ordsucc @ esk94_0) @ X1)), inference(split_conjunct,[status(thm)],[c_0_33])).
23.57/23.77	thf(c_0_43, negated_conjecture, (n_pl @ (ordsucc @ esk94_0) @ (esk72_2 @ esk94_0 @ esk93_0))=(esk93_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37]), c_0_38]), c_0_39])]), c_0_40])).
23.57/23.77	thf(c_0_44, negated_conjecture, in @ (esk72_2 @ esk94_0 @ esk93_0) @ nat, inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_36]), c_0_37]), c_0_38]), c_0_39])]), c_0_40])).
23.57/23.77	thf(c_0_45, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_44])]), ['proof']).
23.57/23.77	# SZS output end CNFRefutation
23.57/23.77	# Proof object total steps             : 46
23.57/23.77	# Proof object clause steps            : 13
23.57/23.77	# Proof object formula steps           : 33
23.57/23.77	# Proof object conjectures             : 12
23.57/23.77	# Proof object clause conjectures      : 9
23.57/23.77	# Proof object formula conjectures     : 3
23.57/23.77	# Proof object initial clauses used    : 8
23.57/23.77	# Proof object initial formulas used   : 17
23.57/23.77	# Proof object generating inferences   : 5
23.57/23.77	# Proof object simplifying inferences  : 12
23.57/23.77	# Training examples: 0 positive, 0 negative
23.57/23.77	# Parsed axioms                        : 404
23.57/23.77	# Removed by relevancy pruning/SinE    : 0
23.57/23.77	# Initial clauses                      : 639
23.57/23.77	# Removed in clause preprocessing      : 169
23.57/23.77	# Initial clauses in saturation        : 470
23.57/23.77	# Processed clauses                    : 16107
23.57/23.77	# ...of these trivial                  : 232
23.57/23.77	# ...subsumed                          : 9485
23.57/23.77	# ...remaining for further processing  : 6390
23.57/23.77	# Other redundant clauses eliminated   : 149424
23.57/23.77	# Clauses deleted for lack of memory   : 0
23.57/23.77	# Backward-subsumed                    : 56
23.57/23.77	# Backward-rewritten                   : 368
23.57/23.77	# Generated clauses                    : 1333720
23.57/23.77	# ...of the previous two non-trivial   : 1169835
23.57/23.77	# Contextual simplify-reflections      : 1207
23.57/23.77	# Paramodulations                      : 1085388
23.57/23.77	# Factorizations                       : 2
23.57/23.77	# NegExts                              : 139
23.57/23.77	# Equation resolutions                 : 150124
23.57/23.77	# Propositional unsat checks           : 0
23.57/23.77	#    Propositional check models        : 0
23.57/23.77	#    Propositional check unsatisfiable : 0
23.57/23.77	#    Propositional clauses             : 0
23.57/23.77	#    Propositional clauses after purity: 0
23.57/23.77	#    Propositional unsat core size     : 0
23.57/23.77	#    Propositional preprocessing time  : 0.000
23.57/23.77	#    Propositional encoding time       : 0.000
23.57/23.77	#    Propositional solver time         : 0.000
23.57/23.77	#    Success case prop preproc time    : 0.000
23.57/23.77	#    Success case prop encoding time   : 0.000
23.57/23.77	#    Success case prop solver time     : 0.000
23.57/23.77	# Current number of processed clauses  : 5908
23.57/23.77	#    Positive orientable unit clauses  : 326
23.57/23.77	#    Positive unorientable unit clauses: 23
23.57/23.77	#    Negative unit clauses             : 704
23.57/23.77	#    Non-unit-clauses                  : 4855
23.57/23.77	# Current number of unprocessed clauses: 1152264
23.57/23.77	# ...number of literals in the above   : 8584987
23.57/23.77	# Current number of archived formulas  : 0
23.57/23.77	# Current number of archived clauses   : 427
23.57/23.77	# Clause-clause subsumption calls (NU) : 7148538
23.57/23.77	# Rec. Clause-clause subsumption calls : 745098
23.57/23.77	# Non-unit clause-clause subsumptions  : 5338
23.57/23.77	# Unit Clause-clause subsumption calls : 443986
23.57/23.77	# Rewrite failures with RHS unbound    : 225
23.57/23.77	# BW rewrite match attempts            : 276
23.57/23.77	# BW rewrite match successes           : 117
23.57/23.77	# Condensation attempts                : 0
23.57/23.77	# Condensation successes               : 0
23.57/23.77	# Termbank termtop insertions          : 36127762
23.62/23.83	
23.62/23.83	# -------------------------------------------------
23.62/23.83	# User time                : 22.767 s
23.62/23.83	# System time              : 0.704 s
23.62/23.83	# Total time               : 23.471 s
23.62/23.83	# Maximum resident set size: 2324 pages
23.62/23.83	EOF